雷达虚拟维修训练中交互系统的通用性

基于USB接口技术对"通用雷达装备虚拟维修训练系统(URVMTS)"的人机交互系统进行研究,通过合理的软、硬件设计实现了系统的通用性。不同的实装操作部件经过适当的信号调理均可以通过该系统方便地实现与雷达虚拟样机之间的交互。着重介绍了交互系统的通用性设计与实现方法,包括系统的通用性设计方案,USB硬件电路的通用性设计及相应的软件开发。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

电扫偶极子相控阵天线的空域极化特性分析

推导了偶极子线性阵列和平面相控阵天线在空域波束电扫时辐射场的极化特性,建立了数学模型。计算结果和仿真分析表明:偶极子相控阵天线辐射场在空域扫描各个波位的极化特性并不一致,是具有一定差异的,当待测目标的方向偏离天线电轴方向时,所接收到的电波极化状态也会随偏离电轴的方向和仰角而改变。该结论对于现代电子战中相控阵天线系统的精确建模与仿真具有重要意义,对于研究和利用天线的极化特性进行雷达极化抗干扰技术是非常必要的。     

固定翼反潜巡逻机作战效能评估

运用改进的Topsis评估模型对反潜巡逻机的作战效能进行评估,主要是对指标权重的计算方法进行改进:综合考虑客观熵权和专家主观权重得到综合权重,通过客观的熵权信息来调整主观权重的偏差,使得反潜巡逻机作战效能的评价结果更为合理。实例分析表明,该方法能够主客观相结合,简单有效,具有一定的推广应用价值。     

新型背腔式对数周期缝隙天线阵列设计

介绍了一种新型背腔式对数周期缝隙天线单元,对其各参数特性进行了分析,并采用这种新型天线单元设计了9×7天线阵列。通过HFSS13进行天线阵列的设计。仿真结果表明,该天线阵列在1.5 GHz~6 GHz的工作带宽内,驻波比小于3,回波损耗小于-10 d B,天线阵列最大增益为29.6 d Bi,在整个工作带宽内,增益均大于20 d Bi。具有良好的定向辐射能力,可用于UWB雷达、探测等领域。     

引入区域量化的相控阵天线维修优化模型

针对大型相控阵天线维修成本高、多部件维修时机难以确定、模型仿真计算困难等问题,提出一种引入区域量化的维修优化模型。建立天线阵列的区域量化模型,将天线阵列维修问题转化成一个由不同区域阵元组成的k/n系统维修优化问题。以使用可用度为约束条件,以单位时间维修费用最小为优化目标,建立引入区域量化的大型相控阵天线多部件视情维修决策优化模型,并通过算例仿真与分析进行了模型验证。结果表明:提出的维修优化模型真实有效,能够很好地解决分布不均匀的相控阵天线维修优化问题。